Cycles of directed graphs defined by matrix multiplication (mod n)
نویسندگان
چکیده
Let A be a k × k matrix over a ring R; let GM (A, R) be the digraph with vertex set R k , and an arc from v to w if and only if w = Av. In this paper, we determine the numbers and lengths of the cycles of GM (A, R) for k = 2 in the following two cases. (a) R = F F q , the q–element finite field, and (b) R = Z Z/nZ Z and GCD(n, det(A)) = 1. This extends previous results for k = 1 and R = Z Z/nZ Z. We make considerable use of the Smith form of a matrix; other than that, the most powerful tool we use is the Chinese Remainder Theorem.
منابع مشابه
On independent domination numbers of grid and toroidal grid directed graphs
A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...
متن کاملDIRECTED GRAPHS DEFINED BY ARITHMETIC (MOD n)
Let a and n > 0 be integers, and define G(a, ri) to be the directed graph with vertex set V{0,1,..., n -1} such that there is an arc from x to y if and only if y = ax (mod ri). Recently, Ehrlich [1] studied these graphs in the special case a = 2 and n odd. He proved that if n is odd, then the number of cycles in G(2, ri) is odd or even according as 2 is or is not a quadratic residue mod n. The ...
متن کاملImproved Distance Queries and Cycle Counting by Frobenius Normal Form
Consider an unweighted, directed graph G with the diameter D. In this paper, we introduce the framework for counting cycles and walks of given length in matrix multiplication time Õ(n). The framework is based on the fast decomposition into Frobenius normal form and the Hankel matrix-vector multiplication. It allows us to solve the following problems efficiently: All Nodes Shortest Cycles – for ...
متن کاملAn Õ(m2n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph
We consider the problem of computing a minimum cycle basis in a directed graph G. The input to this problem is a directed graph whose arcs have positive weights. In this problem a 1 0 1 incidence vector is associated with each cycle and the vector space over generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. ...
متن کاملAll Pairs Shortest Paths in Weighted Directed Graphs ¾ Exact and Almost Exact Algorithms
We present two new algorithms for solving the All Pairs Shortest Paths (APSP) problem for weighted directed graphs. Both algorithms use fast matrix multiplication algorithms. The first algorithm solves the APSP problem for weighted directed graphs in which the edge weights are integers of small absolute value in ~ O(n2+ ) time, where satisfies the equation !(1; ; 1) = 1 + 2 and !(1; ; 1) is the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 239 شماره
صفحات -
تاریخ انتشار 2001